TSTP Solution File: NUM664^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM664^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:04 EDT 2024
% Result : Theorem 0.21s 0.37s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 144 ( 43 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 161 ( 33 ~; 24 |; 0 &; 92 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 23 ( 0 ^ 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
less: nat > nat > $o ).
thf(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f40,f43,f51]) ).
thf(f51,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f50,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f49,f30]) ).
thf(f30,plain,
( ( less @ x @ z )
!= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( less @ x @ z )
!= $true ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
( ( less @ x @ z )
!= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ( less @ x @ z ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ( less @ x @ z ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
less @ x @ z,
file('/export/starexec/sandbox/tmp/tmp.FonYvkVSTA/Vampire---4.8_31331',satz16b) ).
thf(f49,plain,
( ( ( less @ x @ z )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
( ( $true != $true )
| ( ( less @ x @ z )
= $true )
| ~ spl0_1 ),
inference(superposition,[],[f46,f29]) ).
thf(f29,plain,
( ( less @ x @ y )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( less @ x @ y )
= $true ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
less @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
less @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.FonYvkVSTA/Vampire---4.8_31331',l) ).
thf(f46,plain,
( ! [X0: nat] :
( ( ( less @ X0 @ y )
!= $true )
| ( ( less @ X0 @ z )
= $true ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ! [X0: nat] :
( ( $true != $true )
| ( ( less @ X0 @ z )
= $true )
| ( ( less @ X0 @ y )
!= $true ) )
| ~ spl0_1 ),
inference(superposition,[],[f27,f35]) ).
thf(f35,plain,
( ( ( less @ y @ z )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f33,plain,
( spl0_1
<=> ( ( less @ y @ z )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f27,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ X2 @ X1 )
!= $true )
| ( ( less @ X0 @ X1 )
= $true )
| ( ( less @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( less @ X2 @ X1 )
!= $true )
| ( ( less @ X0 @ X2 )
!= $true )
| ( ( less @ X0 @ X1 )
= $true ) ),
inference(rectify,[],[f24]) ).
thf(f24,plain,
! [X1: nat,X2: nat,X0: nat] :
( ( ( less @ X0 @ X2 )
!= $true )
| ( ( less @ X1 @ X0 )
!= $true )
| ( ( less @ X1 @ X2 )
= $true ) ),
inference(flattening,[],[f23]) ).
thf(f23,plain,
! [X1: nat,X0: nat,X2: nat] :
( ( ( less @ X1 @ X2 )
= $true )
| ( ( less @ X0 @ X2 )
!= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X1: nat,X0: nat,X2: nat] :
( ( ( less @ X1 @ X0 )
= $true )
=> ( ( ( less @ X0 @ X2 )
= $true )
=> ( ( less @ X1 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( less @ X1 @ X0 )
=> ( ( less @ X0 @ X2 )
=> ( less @ X1 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X2: nat,X1: nat,X3: nat] :
( ( less @ X1 @ X2 )
=> ( ( less @ X2 @ X3 )
=> ( less @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FonYvkVSTA/Vampire---4.8_31331',satz15) ).
thf(f43,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f42]) ).
thf(f42,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f41,f29]) ).
thf(f41,plain,
( ( ( less @ x @ y )
!= $true )
| ~ spl0_2 ),
inference(backward_demodulation,[],[f30,f39]) ).
thf(f39,plain,
( ( y = z )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f37,plain,
( spl0_2
<=> ( y = z ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f40,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f28,f37,f33]) ).
thf(f28,plain,
( ( ( less @ y @ z )
= $true )
| ( y = z ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( ( less @ y @ z )
= $true )
| ( y = z ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
( ~ ( less @ y @ z )
=> ( y = z ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ~ ( less @ y @ z )
=> ( y = z ) ),
file('/export/starexec/sandbox/tmp/tmp.FonYvkVSTA/Vampire---4.8_31331',k) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM664^1 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34 % Computer : n012.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 14:33:07 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.FonYvkVSTA/Vampire---4.8_31331
% 0.21/0.36 % (31447)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.21/0.37 % (31441)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.21/0.37 % (31443)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.21/0.37 % (31444)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.21/0.37 % (31442)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.21/0.37 % (31445)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.21/0.37 % (31446)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.21/0.37 % (31447)First to succeed.
% 0.21/0.37 % (31448)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.21/0.37 % (31444)Instruction limit reached!
% 0.21/0.37 % (31444)------------------------------
% 0.21/0.37 % (31444)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (31444)Termination reason: Unknown
% 0.21/0.37 % (31444)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (31445)Instruction limit reached!
% 0.21/0.37 % (31445)------------------------------
% 0.21/0.37 % (31445)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (31444)Memory used [KB]: 5373
% 0.21/0.37 % (31444)Time elapsed: 0.003 s
% 0.21/0.37 % (31444)Instructions burned: 2 (million)
% 0.21/0.37 % (31444)------------------------------
% 0.21/0.37 % (31444)------------------------------
% 0.21/0.37 % (31445)Termination reason: Unknown
% 0.21/0.37 % (31445)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (31445)Memory used [KB]: 895
% 0.21/0.37 % (31445)Time elapsed: 0.003 s
% 0.21/0.37 % (31445)Instructions burned: 2 (million)
% 0.21/0.37 % (31445)------------------------------
% 0.21/0.37 % (31445)------------------------------
% 0.21/0.37 % (31447)Refutation found. Thanks to Tanya!
% 0.21/0.37 % SZS status Theorem for Vampire---4
% 0.21/0.37 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.37 % (31447)------------------------------
% 0.21/0.37 % (31447)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (31447)Termination reason: Refutation
% 0.21/0.37
% 0.21/0.37 % (31447)Memory used [KB]: 5500
% 0.21/0.37 % (31447)Time elapsed: 0.004 s
% 0.21/0.37 % (31447)Instructions burned: 2 (million)
% 0.21/0.37 % (31447)------------------------------
% 0.21/0.37 % (31447)------------------------------
% 0.21/0.37 % (31440)Success in time 0.016 s
% 0.21/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------